Using genetic algorithms to solve the multi-product JIT sequencing problem with set-ups
نویسندگان
چکیده
This paper presents a methodology to solve the Just-in-Time (JIT) sequencing problem for multiple product scenarios when set-ups between products are required. Problems of this type are combinatorial, and complete enumeration of all possible solutions is computationally prohibitive. Therefore, Genetic Algorithms are often employed to ® nd desirable, although not necessarily optimal, solutions. This research, through experimentation, shows that Genetic Algorithms provide formidable solutions to the multi-product JIT sequencing problem with set-ups. The results also compare favourably to those found using the search techniques of Tabu Search and Simulated Annealing.
منابع مشابه
Genetic and Memetic Algorithms for Sequencing a New JIT Mixed-Model Assembly Line
This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...
متن کاملA multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation
Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملAddressing a fixed charge transportation problem with multi-route and different capacities by novel hybrid meta-heuristics
In most real world application and problems, a homogeneous product is carried from an origin to a destination by using different transportation modes (e.g., road, air, rail and water). This paper investigates a fixed charge transportation problem (FCTP), in which there are different routes with different capacities between suppliers and customers. To solve such a NP-hard problem, four meta-heur...
متن کاملA Mathematical Programming Model and Genetic Algorithm for a Multi-Product Single Machine Scheduling Problem with Rework Processes
In this paper, a multi-product single machine scheduling problem with the possibility of producing defected jobs, is considered. We concern rework in the scheduling environment and propose a mixed-integer programming (MIP) model for the problem. Based on the philosophy of just-in-time production, minimization of the sum of earliness and tardiness costs is taken into account as the objective fu...
متن کامل